Maximizing profit in green cellular networks through collaborative games
نویسندگان
چکیده
منابع مشابه
Maximizing Profit in Green Cellular Networks through Collaborative Games
In this paper, we deal with the problem of maximizing the profit of Network Operators (NOs) of green cellular networks in situations where Quality-of-Service (QoS) guarantees must be ensured to users, and Base Stations (BSs) can be shared among different operators. We show that if NOs cooperate among them, by mutually sharing their users and BSs, then each one of them can improve its net profit...
متن کاملOn Maximizing Profit through Pricing
Several important practical problems and techniques which are familiar to both actuaries and underwriters are discussed informally and then analyzed mathematically. The main subjects are the degree to which profitability can be improved by estimating the expected losses of risks more accurately, and the usefulness of various methods of improving accuracy. The effect of raising or lowering the g...
متن کاملTraining Of Strategic Decisions In Collaborative Networks Through Serious Games
Serious gaming is an upcoming approach for supporting training activities. Since games have been identified as an opportunity to increase familiarity of the player with any artifacts, they can also be used to mediate experience in management and strategic decision making. In combination with the current trend towards networked games, teaching of strategic decisions in collaborative network envi...
متن کاملMaximizing profit using recommender systems
Traditional recommendation systems make recommendations based solely on the customer’s past purchases, product ratings and demographic data without considering the profitability the items being recommended. In this work we study the question of how a vendor can directly incorporate the profitability of items into its recommender so as to maximize its expected profit while still providing accura...
متن کاملProfit-maximizing pricing for tollbooths
The input to the tollbooth problem is a graph G = (V,E) and a set of m buyers Pi where each buyer is interested in buying a path Pi connecting si, ti ∈ V . Each buyer comes with a budget b(Pi), a positive real number. The problem is to set non-negative prices to the edges E of G. A buyer buys her path Pi if the sum of prices on Pi is at most her budget. If a buyer buys her path, we obtain a pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Networks
سال: 2014
ISSN: 1389-1286
DOI: 10.1016/j.comnet.2014.10.003